6.1 Maximum Flows

نویسنده

  • Michel X. Goemans
چکیده

6. Lecture notes on flows and cuts 6.1 Maximum Flows Network flows deals with modelling the flow of a commodity (water, electricity, packets, gas, cars, trains, money, or any abstract object) in a network. The links in the network are capacitated and the commodity does not vanish in the network except at specified locations where we can either inject or extract some amount of commodity. The main question is how much can be sent in this network. Here is a more formal definition of the maximum flow problem. We have a digraph (directed graph) G = (V,E) and two special vertices s and t; s is called the source and t the sink. We have an upper capacity function u : E → R and also a lower capacity function l : E → R (sometimes chosen to be 0 everywhere). A flow x will be an assignment of values to the arcs (directed edges) so that: 1. for every e ∈ E: l(e) ≤ xe ≤ u(e), 2. for every v ∈ V \ {s, t}:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Debris Flows on Mars: Global Distribution and Their Correlation to Present Day Maximum Surface Pressures and Temperatures

Introduction: The observation of debris flows in high resolution MGS–MOC images suggests that liquid water was involved in their formation in the recent past [1]. The fact that many debris flows on Mars start from the top of isolated peaks [2, 3] and from the crest of dunes [4, 5, 6] favors an origin by melting of near–surface ice by solar heating. The minimum requirements for pure liquid water...

متن کامل

Maximum Flows 6 . 1 The Maximum Flow Problem

6.1 The Maximum Flow Problem In this section we define a flow network and setup the problem we are trying to solve in this lecture: the maximum flow problem. Definition 1 A network is a directed graph G = (V,E) with a source vertex s ∈ V and a sink vertex t ∈ V . Each edge = (v, w) from v to w has a defined capacity, denoted by u(e) or u(v, w). It is useful to also define capacity for any pair ...

متن کامل

Validation of the Conductance Catheter Method to Evaluate Dynamics of a Biomechanical Heart

The conductance catheter method has been applied to evaluate dynamics of a heart cycle. Its validation for the functional analysis of Biomechanical Hearts (BMH), autologous muscular blood pumps with a stabilizing pumping chamber, has not yet been reported. In a test apparatus, a fluid filled pumping chamber of a BMH was hydraulically compressed by a moving piston. Volume shift was measured simu...

متن کامل

Limit theorems for maximum flows on a lattice

We independently assign a non-negative value, as a capacity for the quantity of flows per unit time, with a distribution F to each edge on the Zd lattice. We consider the maximum flows through the edges of two disjoint sets, that is from a source to a sink, in a large cube. In this paper, we show that the ratio of the maximum flow and the size of source is asymptotic to a constant. This constan...

متن کامل

Reducing Directed Max Flow to Undirected Max Flow and Bipartite Matching

In this paper, we prove two new results related to finding maximum flows in directed graphs and finding maximum matchings in bipartite graphs. In our first result, we derive a new algorithm for finding maximum flows in directed graphs. Our algorithm works by reducing a maximum flow problem on a directed graph to a maximum flow problem on an undirected graph, and running the Karger-Levine algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009